Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding
نویسندگان
چکیده
The modified discrete cosine transform (MDCT) is always employed in transform-coding schemes as the analysis/ synthesis filter bank. In this paper, an efficient algorithm for MDCT and inverse MDCT (IMDCT) computation for MPEG-1 audio layer III and MPEG-2 international audio-coding standards is proposed, using only the type-II DCT. Finally, the proposed algorithm is compared to the similar algorithms in this paper.
منابع مشابه
Mixed-radix Algorithm for the Computation of Forward and Inverse MDCT
The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computational intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficient computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation in frequency (DIF) algorit...
متن کاملNew fast algorithms for the low delay MDCT computation in the MPEG-4 AAC enhanced low delay audio coding standard
Recently, the MPEG committee has completed the development of a new audio coding standard, the MPEG-4 Advanced Audio Coding-Enhanced Low Delay (AAC-ELD). The stateof-the-art MPEG audio coding standards, such as MPEG-4 AAC Low Complexity (AAC-LC), High Efficiency AAC (HE-AAC) and AAC Low Delay (AAC-LD), utilize for the time-tofrequency transformation of an audio block and vice versa, the well kn...
متن کاملA fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size M×N into four 2-D discrete cosine transforms (DCTs) with block size (M/4)×(N/4). It is based on an algorithm recently presented by Cho [7] for the efficient calculation of one-dimensional MDCT ...
متن کاملImproved and Extended Mixed-Radix Decimation in Frequency Fast MDCT Algorithm
Recently, a mixed-radix decimation in frequency (DIF) fast MDCT algorithm only for the mixed-radix decompositions or composite lengths N = 3m×2, m > 0, has been proposed in [4]. An improved mixed-radix DIF fast MDCT algorithm both in terms of the regularity and computational complexity is described. Based on observed simple algebraic identities in the original proposed algorithm [4], new formul...
متن کاملComputation of forward and inverse MDCT using Clenshaw's recurrence formula
The forward and inverse modified discrete cosine transform (MDCT) are two of the most computational intensive operations in the MPEG audio coding standard. In this paper, we used Clenshaw’s recurrence formula to transform kernels of the MDCT and IMDCT of the general length. Efficient implementations of MDCT and IMDCT are obtained. The proposed regular structures are particularly suitable for pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Signal Processing
دوره 86 شماره
صفحات -
تاریخ انتشار 2006